Symmetric Cubic Graphs of Girth at Most 7
نویسندگان
چکیده
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be represented as one-skeletons of regular polyhedra in the plane, projective plane or in torus. With the exception of K3,3, we can find an associated regular polyhedron such that the girth of the graph coincide with the face-size. In this paper we show that with three more exceptions the symmetric cubic graphs of girth g ≤ 7 are one-skeletons of trivalent regular maps with face-size g. All the symmetric cubic graphs of girth 6 except the generalised Petersen graphs GP (8, 3) and GP (10, 3) are one-skeletons of toroidal regular maps of type {6, 3}. We give a simple numerical criterium to determine the degree s of s-regularity of these graphs and derive the presentations of the automorphism groups. As concerns girth 7, the only exceptional graph is the well-known Coxeter graph on 28 vertices. We prove that all the other symmetric cubic graphs of girth 7 are underlying graphs of regular maps of type {7, 3} which are known as Hurwitz maps. Some more results on symmetric cubic graphs with exactly two girth cycles passing through an edge are proved
منابع مشابه
Symmetric cubic graphs of small girth
A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. We show that a symmetric cubic graph of girth at most 9 is either 1-regular or 2-regular (following the notation of Djokovic), or...
متن کاملNonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vert...
متن کاملCircular edge-colorings of cubic graphs with girth six
We show that the circular chromatic index of a (sub)cubic graph with girth at least six is at most 7/2.
متن کاملIrreducible pseudo 2-factor isomorphic cubic bipartite graphs
A bipartite graph is pseudo 2–factor isomorphic if all its 2–factors have the same parity of number of circuits. In a previous paper we have proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3, and partially characterized them. In particular we proved that the only essentially 4–edge-connected pseudo 2–factor isomorphic cubic bipartite graph of girth 4 is K3,3...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کامل